Motif-All: discovering all phosphorylation motifs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering larger network motifs: Network Motif clustering

In this project, we aim to discover large network motifs. The main idea would be 1) combining smaller network motifs and extend it to larger network motifs or 2) using clustering algorithms to find more compact representation for the whole network, then using existing or new algorithm for finding network motifs. In order to find the appropriate approaches, we reviewed some of related papers, ab...

متن کامل

ARCS-Motif: discovering correlated motifs from unaligned biological sequences

MOTIVATION The goal of motif discovery is to detect novel, unknown, and important signals from biology sequences. In most models, the importance of a motif is equal to the sum of the similarity of every single position. In 2006, Song et al. introduced Aggregated Related Column Score (ARCS) measure which includes correlation information to the evaluation of motif importance. The paper showed tha...

متن کامل

Discovering larger network motifs: Network clustering for Network Motif discovery

We want to discover larger network motifs, with more than 15 number of nodes. In order to propose an algorithm for finding larger network motifs in any biological network, we review some of models and algorithms to find network motifs. There are two types of methods, one is exact counting and the other is approximate sampling. Generalization of random graphs is another important issue to evalua...

متن کامل

Discovering Colored Network Motifs

Network motifs are small overrepresented patterns that have been used successfully to characterize complex networks. Current algorithmic approaches focus essentially on pure topology and disregard node and edge nature. However, it is often the case that nodes and edges can also be classified and separated into different classes. This kind of networks can be modeled by colored (or labeled) graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2011

ISSN: 1471-2105

DOI: 10.1186/1471-2105-12-s1-s22